O(n^2)

Home > Computer Science > Algorithms and data structures > Big O Notation > O(n^2)

This represents quadratic time complexity, which means that the execution time increases exponentially as the input size increases. Examples include some sorting algorithms like selection sort and bubble sort.